Alternating Tree Automata with Qualitative Semantics
نویسندگان
چکیده
منابع مشابه
Alternating two-way AC-tree automata
We explore the notion of alternating two-way tree automata modulo the theory of finitely many associative-commutative (AC) symbols. This was prompted by questions arising in cryptographic protocol verification, in particular in modeling group key agreement schemes based on Diffie-Hellman-like functions, where the emptiness question for intersections of such automata is fundamental. This also ha...
متن کاملEmptiness Of Alternating Tree Automata Using Games With Imperfect Information
We consider the emptiness problem for alternating tree automata, with two acceptance semantics: classical (all branches are accepted) and qualitative (almost all branches are accepted). For the classical semantics, the usual technique to tackle this problem relies on a Simulation Theorem which constructs an equivalent non-deterministic automaton from the original alternating one, and then check...
متن کاملMax and Sum Semantics for Alternating Weighted Automata
In the traditional Boolean setting of formal verification, alternating automata are the key to many algorithms and tools. In this setting, the correspondence between disjunctions/conjunctions in the specification and nondeterministic/universal transitions in the automaton for the specification is straightforward. A recent exciting research direction aims at adding a quality measure to the satis...
متن کاملAlternating Tree Automata, Parity Games, and Modal -Calculus
2 From Modal -Calculus to Alternating Tree Automata 4 2.1 Modal -Calculus . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 Kripke Structures . . . . . . . . . . . . . . . . . . . . . . 5 2.1.2 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.3 Substitution . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.1.4 Semantics . . . . . . . . . . . . . . . . . . . . . ....
متن کاملFrom $μ$-Calculus to Alternating Tree Automata using Parity Games
μ-Calculus and automata on infinite trees are complementary ways of describing infinite tree languages. The correspondence between μ-Calculus and alternating tree automaton is used to solve the satisfiability and model checking problems by compiling the modal μ-Calculus formula into an alternating tree automata. Thus advocating an automaton model specially tailored for working with modal μ-Calc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Computational Logic
سال: 2021
ISSN: 1529-3785,1557-945X
DOI: 10.1145/3431860